On the Stability of Dynamic Diffusion Load Balancing
نویسندگان
چکیده
منابع مشابه
Dynamic Diffusion Load Balancing
We consider the problem of dynamic load balancing in arbitrary (connected) networks on n nodes. Our load generation model is such that during each round, n tasks are generated on arbitrary nodes, and then (possibly after some balancing) one task is deleted from every nonempty node. Notice that this model fully saturates the resources of the network in the sense that we generate just as many new...
متن کاملAccelerated diffusion algorithms for dynamic load balancing
We consider the load balancing problem for a synchronous distributed processor network. The processor network is modeled by an undirected, connected graph G = (V,E) in which node vi ∈ V possesses a computational load wi. We want to determine a schedule in order to move load across edges so that the weight on each node is approximately equal. This problem models load balancing when we associate ...
متن کاملModified Diffusion Dynamic Load Balancing Employing Mobile Agents
The escalating complexity and mobility of today’s networks has led to the increased application of mobile agent paradigm. This paradigm helps to alleviate bandwidth limitations and supports disconnected operations that are both significant problems in wireless and mobile environments. On the other hand, load balancing is one of the important problems of computer heterogeneous networks. To addre...
متن کاملA Multi-Level Diffusion Method for Dynamic Load Balancing
Horton, G., A multi-level diffusion method for dynamic load balancing, Parallel Computing 19 (1993) 209-218. We consider the problem of dynamic load balancing for multiprocessors, for which a typical application is a parallel finite element solution method using non-structured grids and adaptive grid refinement. This type of application requires communication between the subproblems which arise...
متن کاملLoad Balancing in Dynamic Networks by Bounded Delays Asynchronous Diffusion
Load balancing is a well known problem, which has been extensively addressed in parallel algorithmic. However, there subsist some contexts in which the existing algorithms cannot be used. One of these contexts is the case of dynamic networks where the links between the different elements are intermittent. We propose in this paper an efficient algorithm, based on asynchronous diffusion, to perfo...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Algorithmica
سال: 2007
ISSN: 0178-4617,1432-0541
DOI: 10.1007/s00453-007-9081-y